Persistence of Termination for Term Rewriting Systems with Ordered Sorts
نویسنده
چکیده
A property is persistent if for any many-sorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema’s result can be extended to term rewriting systems on ordered sorts, i.e., termination is persistent for term rewriting systems on ordered sorts without collapsing, decreasing or duplicating rules. Furthermore we give the example as application of this result. Also we obtain that completeness is persistent for this class of term rewriting systems.
منابع مشابه
Persistence of Termination for Right-Linear Overlay Term Rewriting Systems
A property is called persistent if for any manysorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that termination is persistent for right-linear overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that termina...
متن کاملPersistence of Termination for Locally Confluent Overlay Term Rewriting Systems
A property is called persistent if for any manysorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that termination is persistent for locally confluent overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that co...
متن کاملPersistence of Termination for Non-Overlapping Term Rewriting Systems
A property is called persistent if for any manysorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that termination is persistent for non-overlapping term rewriting systems and we give the example as application of this result. Furthermore we obtain that completeness...
متن کاملTermination of term rewriting using dependency pairs
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left-and right-hand sides of rewrite rules, but introduce the notion of dependency pairs to compare left-hand sides with special subterms of the right-hand sides. This results in a technique which allows to apply existing methods for...
متن کاملTermination of Term Rewriting: Interpretation and Type Elimination
We investigate proving termination of term rewriting systems by interpretation of terms in a well-founded monotone algebra. The well-known polynomial interpretations can be considered as a particular case in this framework. A classiication of types of termination , including simple termination, is proposed based on properties in the semantic level. A transformation on term rewriting systems eli...
متن کامل